package nio;

// Basic node stored in unbalanced binary search trees
// Note that this class is not accessible outside
// of package DataStructures

class BinaryNode<E extends Comparable<E>> {
	// Constructors
	BinaryNode(final E theElement) {
		this(theElement, null, null);
	}

	BinaryNode(final E theElement, final BinaryNode<E> lt,
			final BinaryNode<E> rt) {
		element = theElement;
		left = lt;
		right = rt;
	}

	// Friendly data; accessible by other package routines
	final E element; // The data in the node
	BinaryNode<E> left; // Left child
	BinaryNode<E> right; // Right child
}
